Local Search Trajectories over S-box space

نویسندگان

چکیده

A local search method is developed and applied to create trajectories over S-box spaces in this work. These show a strong linear correlation between confusion coefficient variance, transparency order, modified revised order under the Hamming weight model. When variance values increase, of beta zero, zero decrease, reflecting same theoretical resistance against side-channel attacks by power consumption. From best our knowledge, it first time that Local Search are used discover relations cryptography properties. The experimental results comparisons provide evidence capabilities proposal handle problems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Local Search over Relational Databases

Solving combinatorial problems is increasingly crucial in business applications, in order to cope with hard problems of practical relevance. However, the approach of exploiting, in production scenarios, current constraint or mathematical programming solvers has severe limitations, which demand new methods: data is usually stored in potentially large relational databases, and maintaining the pro...

متن کامل

Local Search for Designing Noise-Minimal Rotorcraft Approach Trajectories

NASA and the international community are investing in the development of a commercial transportation infrastructure that includes the increased use of rotorcraft, specifically helicopters and civil tilt rotors. However, there is significant concern over the impact of noise on the communities surrounding the transportation facilities. One way to address the rotorcraft noise problem is by exploit...

متن کامل

Restarted Local Search Algorithms for Continuous Black Box Optimization

Several local search algorithms for real-valued domains (axis parallel line search, Nelder-Mead simplex search, Rosenbrock's algorithm, quasi-Newton method, NEWUOA, and VXQR) are described and thoroughly compared in this article, embedding them in a multi-start method. Their comparison aims (1) to help the researchers from the evolutionary community to choose the right opponent for their algori...

متن کامل

SAT-Encodings, Search Space Structure, and Local Search Performance

Stochastic local search (SLS) algorithms for prepositional satisfiability testing (SAT) have become popular and powerful tools for solving suitably encoded hard combinatorial from different domains like, e.g., planning. Consequently, there is a considerable interest in finding SAT-encodings which facilitate the efficient application of SLS algorithms. In this work, we study how two encodings sc...

متن کامل

Title : Fast Local Search and Guided Local Search and Their Application to British Telecom ’ s Workforce

This paper reports a Fast Local Search (FLS) algorithm which helps to improve the efficiency of hill climbing and a Guided Local Search (GLS) Algorithm which is developed to help local search to escape local optima and distribute search effort. To illustrate how these algorithms work, this paper describes their application to British Telecom’s workforce scheduling problem, which is a hard real ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of information security and applications

سال: 2022

ISSN: ['2214-2134', '2214-2126']

DOI: https://doi.org/10.1016/j.jisa.2022.103272